Transposing Relations: From Maybe Functions to Hash Tables
نویسندگان
چکیده
Functional transposition is a technique for converting relations into functions aimed at developing the relational algebra via the algebra of functions. This paper attempts to develop a basis for generic transposition. Two instances of this construction are considered, one applicable to any relation and the other applicable to simple relations only. Our illustration of the usefulness of the generic transpose takes advantage of the free theorem of a polymorphic function. We show how to derive laws of relational combinators as free theorems of their transposes. Finally, we relate the topic of functional transposition with the hashing technique for efficient data representation.
منابع مشابه
The Usefulness of Multilevel Hash Tables with Multiple Hash Functions in Large Databases
In this work, attempt is made to select three good hash functions which uniformly distribute hash values that permute their internal states and allow the input bits to generate different output bits. These functions are used in different levels of hash tables that are coded in Java Programming Language and a quite number of data records serve as primary data for testing the performances. The re...
متن کاملAspect Oriented UML to ECORE Model Transformation
With the emerging concept of model transformation, information can be extracted from one or more source models to produce the target models. The conversion of these models can be done automatically with specific transformation languages. This conversion requires mapping between both models with the help of dynamic hash tables. Hash tables store reference links between the elements of the source...
متن کاملWeakly Principal Component Hashing with Multiple Tables
Image hashing based Approximate Nearest Neighbor (ANN) searching has drawn much attention in large-scale image dataset application, where balance the precision and high recall rate is difficulty task. In this paper, we propose a weakly principal component hash method with multiple tables to encode binary codes. Analyzing the distribution of projected data on different principal component direct...
متن کاملReciprocal Hash Tables for Nearest Neighbor Search
Recent years have witnessed the success of hashing techniques in approximate nearest neighbor search. In practice, multiple hash tables are usually employed to retrieve more desired results from all hit buckets of each table. However, there are rare works studying the unified approach to constructing multiple informative hash tables except the widely used random way. In this paper, we regard th...
متن کاملA Semi-group of Hashing Functions & Hash Tables
A model of a hash table is reviewed and problems with the model and operations on the model are identified. A collection of isomorphic monoids is found, in each of which will be a semi-group, represented hashing functions and hash tables. One of the semi-groups is used to redefine the previously examined operations. Finally, some algebraic questions arising from the model are answered.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004